On a Conjecture of A. J. Hoffman. Ii
نویسنده
چکیده
It is proved that certain incidence relations of hyperplanes and closed convex sets in a rf-polytope can be preserved while replacing these sets by suitable polytopal subsets. The purpose of this paper is to prove Theorem 1. IfP is a d-polytope in Ed and Cx, * • •, Cj are closed convex subsets of P, such that every hyperplane that meets P meets (J¿=i Q> tnen there exist poly topes Dx, • • ■ , Dk with D¿c: C{ for all ll. Conjecture (3, 1, 3) is true (see Remark 4). Definitions. A polytope P is the convex hull of a finite set of points in the Euclidean o*-dimensional space Ed; a d-polytope in Ed is a polytope with nonempty interior; Vert F denotes here the set of vertices of a polytope P; if A<=E", conv A denotes the convex hull of A. An (affine) t-flat in Ed is a translate of a /-dimensional subspace of Ed, and a hyperplane is a (d— l)-flat. If His a hyperplane in Ed, then H+ and H_ (H+ and H_) denote the two closed (open, respectively) half-spaces of Ed, determined by H. Presented to the Society, January 23, 1971 ; received by the editors October 28, 1970. AMS 1969 subject classifications. Primary 5210, 5230; Secondary 5245.
منابع مشابه
Frankl's Conjecture for a subclass of semimodular lattices
In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...
متن کاملA note on‘‘A case study approach for developing a project performance evaluation system”
The major aim of this research is benchmarking Honeywell Federal Manufacturing &Technologies projects using Data Envelopment Analysis (DEA) technique and to compare the results with that of published recently in Qing Cao, James J. Hoffman Qing Cao, James J. Hoffman. (2011). A case study approach for developing a project performance evaluation system. International Journal of Project Managem...
متن کاملOn the Closed-Form Solution of a Nonlinear Difference Equation and Another Proof to Sroysang’s Conjecture
The purpose of this paper is twofold. First we derive theoretically, using appropriate transformation on x(n), the closed-form solution of the nonlinear difference equation x(n+1) = 1/(±1 + x(n)), n ∈ N_0. The form of solution of this equation, however, was first obtained in [10] but through induction principle. Then, with the solution of the above equation at hand, we prove a case ...
متن کاملOn Silverman's conjecture for a family of elliptic curves
Let $E$ be an elliptic curve over $Bbb{Q}$ with the given Weierstrass equation $ y^2=x^3+ax+b$. If $D$ is a squarefree integer, then let $E^{(D)}$ denote the $D$-quadratic twist of $E$ that is given by $E^{(D)}: y^2=x^3+aD^2x+bD^3$. Let $E^{(D)}(Bbb{Q})$ be the group of $Bbb{Q}$-rational points of $E^{(D)}$. It is conjectured by J. Silverman that there are infinitely many primes $p$ for which $...
متن کاملSimple groups with the same prime graph as $D_n(q)$
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
متن کاملA note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کامل